On additive and multiplicative decompositions of sets of integers with restricted prime factors, I. (Smooth numbers)

نویسندگان

چکیده

In Sárközy (2001) the third author of this paper presented two conjectures on additive decomposability sequence ”smooth” (or ”friable”) numbers. Elsholtz and Harper (2015) proved (by using sieve methods) second (less demanding) conjecture. The goal is to extend sharpen their result in three directions by a different approach (based theory S-unit equations).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On smooth sets of integers

This work studies evenly distributed sets of integers — sets whose quantity within each interval is proportional to the size of the interval, up to a bounded additive deviation. Namely, for ρ,∆ ∈ R a set A of integers is (ρ,∆)-smooth if abs(|I| · ρ − |I ∩ A|) < ∆ for any interval I of integers; a set A is ∆-smooth if it is (ρ,∆)-smooth for some real number ρ. The paper introduces the concept of...

متن کامل

Additive and Multiplicative Properties of Beta - Integers

| To each number > 1 there corresponds a discrete countable set of numbers denoted by Z and named set of beta-integers. The set Z is precisely the set of real numbers which are polynomial in when they are written in \basis ", and Z = Zwhen 2 N. We prove here a list of arithmetic properties of Z : addition, multiplication, relation with integers, when is a quadratic Pisot-Vijayaraghavan unit (qu...

متن کامل

Prime factors of consecutive integers

This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in the sequence of integers at least one of whose prime factors exceeds k. This algorithm enables us to show that f(k) is not monotone, verifying a conjecture of Ecklund and Eggleton.

متن کامل

Additive and Multiplicative Structures of C ? - Sets

It is known that for an IP? set A in (N,+) and a sequence hxnin=1 in N, there exists a sum subsystem hynin=1 of hxnin=1 such that FS(hynin=1) [ FP (hynin=1) ✓ A. Similar types of results have also been proved for central? sets where the sequences have been considered from the class of minimal sequences. In this present work, we shall prove some analogous results for C?-sets for a more general c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indagationes Mathematicae

سال: 2021

ISSN: ['0019-3577', '1872-6100']

DOI: https://doi.org/10.1016/j.indag.2020.10.007